Superiority of one-way and realtime quantum machines
نویسندگان
چکیده
منابع مشابه
Superiority of One-Way and Realtime Quantum Machines and New Directions
In automata theory, the quantum computation has been widely examined for finite state machines , known as quantum finite automata (QFAs), and less attention has been given to the QFAs augmented with counters or stacks. Moreover, to our knowledge, there is no result related to QFAs having more than one input head. In this paper, we focus on such generalizations of QFAs whose input head(s) operat...
متن کاملOne-way quantum computer simulation
In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of bases for these measurements as well as the structure of the entanglements specify a quantum algorithm. As scalable and reliable quantum computers have not been implemented yet, quantum computation simulators are the only w...
متن کاملA one-way quantum computer.
We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state, thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.
متن کاملOne-Way Probabilistic Reversible and Quantum One-Counter Automata
Kravtsev introduced 1-way quantum 1-counter automata (1Q1CAs), and showed that several non-context-free languages can be recognized by bounded error 1Q1CAs. In this paper, we rst show that all of these non-context-free languages can be also recognized by bounded error 1PR1CAs (and so 1Q1CAs). Moreover, the accepting probability of each of these 1PR1CAs is strictly greater than, or at least equa...
متن کاملAbstract And-parallel Machines ? And-parallel Turing Machines. One Way of Viewing the Nondeterministic
And-Parallel Machines ? Nachum Dershowitz and Naomi Lindenstrauss Department of Computer Science, The Hebrew University, Jerusalem 91904, Israel The deterministic Turing machine, though abstract, can still be seen as a model of a realistic computer. The same cannot be said for the nondeterministic Turing machine as a model of parallel computing. We introduce several abstract machines with ne-gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2012
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2012018